package com.example.leetcode.graph;

import com.example.leetcode.graph.common.GraphUtils;

class Solution1168 {
    public int minCostToSupplyWater(int n, int[] wells, int[][] pipes) {
        return GraphUtils.minCostToSupplyWater(n, wells, pipes);
    }
}
public class leetcode1168 {
    public static void main(String[] args) {
        Solution1168 solution1168 = new Solution1168();
        int n = 3;
        int[] wells = {1,2,2};
        int[][] pipes = {{1,2,1},{2,3,1}};
        System.out.println(solution1168.minCostToSupplyWater(n, wells, pipes));
    }
}
